A rounding algorithm for integer programs
نویسندگان
چکیده
منابع مشابه
A Parametric Integer Programming Algorithm for Bilevel Mixed Integer Programs
We consider discrete bilevel optimization problems where the follower solves an integer program with a fixed number of variables. Using recent results in parametric integer programming, we present polynomial time algorithms for pure and mixed integer bilevel problems. For the mixed integer case where the leader’s variables are continuous, our algorithm also detects whether the infimum cost fail...
متن کاملSolving Packing Integer Programs via Randomized Rounding with Alterations
We give new approximation algorithms for packing integer programs (PIPs) by employing the method of randomized rounding combined with alterations. Our first result is a simpler approximation algorithm for general PIPs which matches the best known bounds, and which admits an efficient parallel implementation. We also extend these results to a multi-criteria version of PIPs. Our second result is ...
متن کاملAn Improved Algorithm for Biobjective Integer Programs
A parametric algorithm for identifying the Pareto set of a biobjective integer program is proposed. The algorithm is based on the weighted Chebyshev (Tchebycheff) scalarization, and its running time is asymptotically optimal. A number of extensions are described, including: a technique for handling weakly dominated outcomes, a Pareto set approximation scheme, and an interactive version that pro...
متن کاملInteger rounding and modified integer rounding for the skiving stock problem
We consider the one-dimensional skiving stock problem which is also known as the dual bin packing problem: find the maximum number of items with minimum length L that can be constructed by connecting a given supply of m ∈ N smaller item lengths l1, . . . , lm with availabilities b1, . . . , bm. For this optimization problem, we investigate the quality of the continuous relaxation by considering...
متن کاملA Branch-and-cut Algorithm for Integer Bilevel Linear Programs
We describe a rudimentary branch-and-cut algorithm for solving integer bilevel linear programs that extends existing techniques for standard integer linear programs to this very challenging computational setting. The algorithm improves on the branch-and-bound algorithm of Moore and Bard in that it uses cutting plane techniques to produce improved bounds, does not require specialized branching s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1994
ISSN: 0166-218X
DOI: 10.1016/0166-218x(92)00174-k